Random Popular Matchings with Incomplete Preference Lists
نویسندگان
چکیده
منابع مشابه
Random Popular Matchings with Incomplete Preference Lists
For a set A of n people and a set B of m items, with each person having a preference list that ranks some items in order of preference, we consider the problem of matching every person with a unique item. A matching M is called popular if for any other matching M ′, the number of people who prefer M to M ′ is not less than the number of those who prefer M ′ to M . For given n and m, consider th...
متن کاملWeighted Random Popular Matchings
For a set A of n applicants and a set I of m items, let us consider the problem of matching applicants to items, where each applicant x ∈ A provides its preference list defined on items. We say that an applicant x prefers an item p than an item q if p is located at higher position than q in its preference list. For any matchingsM andM′ of the matching problem, we say that an applicant x prefers...
متن کاملRandom Almost-Popular Matchings
For a set A of n people and a set B ofm items, with each person having a preference list that ranks all items from most wanted to least wanted, we consider the problem of matching every person with a unique item. A matchingM is called -popular if for any other matching M ′, the number of people who prefer M ′ to M is at most n plus the number of those who prefer M to M ′. In 2006, Mahdian showe...
متن کاملCharacterizing a Set of Popular Matchings Defined by Preference Lists with Ties
In this paper, we give a characterization of a set of popular matchings in a bipartite graph with one-sided preference lists. The concept of a popular matching was first introduced by Gardenfors [5]. Recently, Abraham et al. [1] discussed a problem for finding a popular matching and proposed polynomial time algorithms for problem instances defined by preference lists with or without ties. McDer...
متن کاملStable Matchings with Ties, Master Preference Lists, and Matroid Constraints
In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2019
ISSN: 1526-1719
DOI: 10.7155/jgaa.00513